Induction By Attribute Elimination

نویسندگان

  • Xindong Wu
  • David Urpani
چکیده

ÐIn most data-mining applications where induction is used as the primary tool for knowledge extraction from real-world databases, it is difficult to precisely identify a complete set of relevant attributes. This paper introduces a new rule induction algorithm called Rule Induction Two In One (RITIO), which eliminates attributes in the order of decreasing irrelevancy. Like ID3-like decision tree construction algorithms, RITIO makes use of the entropy measure as a means of constraining the hypothesis search space; but, unlike ID3-like algorithms, the hypotheses language is the rule structure and RITIO generates rules without constructing decision trees. The final concept description produced by RITIO is shown to be largely based on only the most relevant attributes. Experimental results confirm that, even on noisy, industrial databases, RITIO achieves high levels of predictive accuracy. Index TermsÐData mining, rule induction, attribute selection, information

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute oriented induction with star schema

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribu...

متن کامل

Induction by Fuzzy Attribute Elimination

A group of rules is belonging to one of the most popular, effective and userfriendly knowledge representation technologies. In this paper, a new direct method for making classification fuzzy rules on the basis of fuzzy attribute elimination is proposed. This elimination works with widely usable fuzzy attributes and eliminates them considering their unimportance determined by computing classific...

متن کامل

Trading Off Consistency and Efficiency in version-Space Induction

The Candidate Elimination (CE) algorithm, like most inductive learning algorithms, uses a fixed restricted concept language to focus the search on useful generalisations. The drawback of this approach is that it can easily give rise to inconsistency with data, while not ensuring tractability of the search involved. A more flexible way to trade-off efficiency and consistency during concept learn...

متن کامل

Novel Unified Control Method of Induction and Permanent Magnet Synchronous Motors

Many control schemes have been proposed for induction motor and permanent magnet synchronous motor control, which are almost highly complex and non-linear. Also, a simple and efficient method for unified control of the electric moto are rarely investigated. In this paper, a novel control method based on rotor flux orientation is proposed. The novelties of proposed method are elimination of q-ax...

متن کامل

Matching Methods with Problems: A Comparative Analysis of Constructive Induction Approaches

This paper provides a taxonomy of constructive induction problems and reports on an empirical comparison of several constructive induction methods. In this paper a representation space is said to be poorly suited for learning because of three types of problems: 1) inappropriate attributes or attribute values, 2) incomplete attribute values, attribute sets or examples and 3) incorrect attributes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Knowl. Data Eng.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1999